Mizar Analysis of Algorithms: Algorithms over Integers
نویسندگان
چکیده
منابع مشابه
Mizar Analysis of Algorithms: Algorithms over Integers1
This paper is a continuation of [5] and concerns if-while algebras over integers. In these algebras the only elementary instructions are assignment instructions. The instruction assigns to a (program) variable a value which is calculated for the current state according to some arithmetic expression. The expression may include variables, constants, and a limited number of arithmetic operations. ...
متن کاملMizar Analysis of Algorithms: Preliminaries
Algorithms and its parts – instructions – are formalized as elements of if-while algebras. An if-while algebra is a (1-sorted) universal algebra which has 4 operations: a constant – the empty instruction, a binary catenation of instructions, a ternary conditional instruction, and a binary while instruction. An execution function is defined on pairs (s, I), where s is a state (an element of cert...
متن کاملMIZAR verification of generic algebraic algorithms
Although generic programming founds more and more attention | nowadays generic programming languages as well as generic libraries exist | there are hardly approaches for the veri cation of generic algorithms or generic libraries. This thesis deals with generic algorithms in the eld of computer algebra. We propose theMizar system as a theorem prover capable of verifying generic algorithms on an ...
متن کاملFactoring Integers by CVP Algorithms
We use pruned enumeration algorithms to find lattice vectors close to a specific target vector for the prime number lattice. These algorithms generate multiplicative prime number relations modulo N that factorize a given integer N . The algorithm New Enum performs the stages of exhaustive enumeration of close lattice vectors in order of decreasing success rate. For example an integer N ≈ 10 can...
متن کاملPLASTIC ANALYSIS OF PLANAR FRAMES USING CBO AND ECBO ALGORITHMS
In rigid plastic analysis one of the most widely applicable methods that is based on the minimum principle, is the combination of elementary mechanisms which uses the upper bound theorem. In this method a mechanism is searched which corresponds to the smallest load factor. Mathematical programming can be used to optimize this search process for simple fra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2008
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-008-0024-0